#include "BinarySearchTree.h"

int main(int argc, char* argv[])
{
    BinaryTree<double> A;
    A.insert(6.6);
    A.insert(3.4);
    A.insert(9.8);
    A.insert(0.9);
    A.insert(1.8);
    A.insert(7.4);
    A.insert(-2.3);
    A.insert(11);
    A.insert(8.6);
    A.insert(10);
    A.insert(9.9);
    A.insert(10.5);
    A.insert(14);
    A.insert(9.95);
    A.inorder_walk();
    A.del(9.8);
    A.inorder_walk();
    /* A.test_successor();
    A.test_predecessor();
    A.test_min();
    A.test_max();
    std::cout<< "search 0.9:" << std::endl;
    A.test_search(0.9);
    std::cout<< "search 6.6:" << std::endl;
    A.test_search(6.6);
    std::cout<< "search 7.8:" << std::endl;
    A.test_search(7.8);
    double B[6]={2.3,9.1,-3,7.7,3.5,2.3};
    std::cout << "before:" << std::endl;
    for (int i=0; i<6 ; i++)
      std::cout << B[i] << ",";
    std::cout << "\b\b" << std::endl;
    BST_sort<double>(B,6);
    std::cout << "after:" << std::endl;
    for (int i=0; i<6 ; i++)
      std::cout << B[i] << ",";
      std::cout << "\b\b" << std::endl;*/
    return 0;
};
